A Novel Classification Method with Cubic Spline Interpolation
نویسندگان
چکیده
Classification is the last, and usually most time-consuming step in recognition. Most recently proposed classification algorithms have adopted machine learning (ML) as main approach, regardless of time consumption. This study proposes a statistical feature cubic spline interpolation (FC-CSI) algorithm to classify emotions speech using curve fitting technique. FC-CSI utilized emotion recognition system (SERS). The idea sketch (CSI) for each audio file dataset mean interpolations (MCSIs) representing dataset. CSI generated by connecting features extracted from extraction phase. MCSI 70% files Points on are considered new features. To according emotion, Euclidian distance (ED) found between all MCSIs Each classified nearest it. three datasets used this work Ryerson Audio-Visual Database Emotional Speech Song (RAVDESS), Berlin (Emo-DB), Surrey Expressed Emotion (SAVEE). shows fast high accuracy results. accuracy, i.e., proportion samples assigned correct class, without selection (FS), was 69.08%, 92.52%, 89.1% with RAVDESS, Emo-DB, SAVEE, respectively. results method were compared those designed neural network called SER-NN. Comparisons made FS. outperformed SER-NN Emo-DB underperformed an FS algorithm. It noticed experiments that operated faster than same utilizing
منابع مشابه
Monotonic Cubic Spline Interpolation
This paper describes the use of cubic splines for interpolating monotonic data sets. Interpolating cubic splines are popular for fitting data because they use low-order polynomials and have C2 continuity, a property that permits them to satisfy a desirable smoothness constraint. Unfortunately, that same constraint often violates another desirable property: monotonicity. The goal of this work is...
متن کاملOn a Generalization of Cubic Spline Interpolation
Based on analysis of basic cubic spline interpolation, the clamped cubic spline interpolation is generalized in this paper. The methods are presented on the condition that the first derivative and second derivative of arbitrary node are given. The Clamped spline and Curvature-adjusted cubic spline are also generalized. The methods are presented on the condition that the first derivatives of arb...
متن کاملCubic Spline Coalescence Fractal Interpolation through Moments
This paper generalizes the classical cubic spline with the construction of the cubic spline coalescence hidden variable fractal interpolation function (CHFIF) through its moments, i.e. its second derivative at the mesh points. The second derivative of a cubic spline CHFIF is a typical fractal function that is self-affine or non-self-affine depending on the parameters of the generalized iterated...
متن کاملGeneralized Cubic Spline Fractal Interpolation Functions
We construct a generalized Cr-Fractal Interpolation Function (Cr-FIF) f by prescribing any combination of r values of the derivatives f (k), k = 1, 2, . . . , r, at boundary points of the interval I = [x0, xN ]. Our approach to construction settles several questions of Barnsley and Harrington [J. Approx Theory, 57 (1989), pp. 14–34] when construction is not restricted to prescribing the values ...
متن کاملEfficient cubic spline interpolation implemented with FIR filters
Classical Cubic spline interpolation needs to solve a set of equations of high dimension. In this work we show how to compute the interpolant using a FIR digital filter, with a reduced number of operations per interpolated point and high accuracy. Additionally, the computation can be made on real time as the signal samples are acquired. Following this approach, we show how to obtain easily the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Automation and Soft Computing
سال: 2022
ISSN: ['2326-005X', '1079-8587']
DOI: https://doi.org/10.32604/iasc.2022.018045